10.5 KB · ⇊ 7 parts · ⤓ Micron 10.5 KB · ⤓ HTML 49.8 KB

top

The Titchmarsh convolution theorem describes the properties of the support of the convolution of two functions. It was proven by Edward Charles Titchmarsh in 1926.cite-ref-1[1]

• Titchmarsh convolution theorem

• References

If φ φ ( t ) {\textstyle \varphi (t)\,} and ψ ψ ( t ) {\textstyle \psi (t)} are integrable functions, such that

φ φ ∗ ∗ ψ ψ = ∫ ∫ 0 x φ φ ( t ) ψ ψ ( x − − t ) d t = 0 {\displaystyle \varphi *\psi =\int _{0}^{x}\varphi (t)\psi (x-t)\,dt=0}

almost everywhere in the interval 0 < x < κ κ {\displaystyle 0<x<\kappa \,} , then there exist λ λ ≥ ≥ 0 {\displaystyle \lambda \geq 0} and μ μ ≥ ≥ 0 {\displaystyle \mu \geq 0} satisfying λ λ + μ μ ≥ ≥ κ κ {\displaystyle \lambda +\mu \geq \kappa } such that φ φ ( t ) = 0 {\displaystyle \varphi (t)=0\,} almost everywhere in 0 < t < λ λ {\displaystyle 0<t<\lambda } and ψ ψ ( t ) = 0 {\displaystyle \psi (t)=0\,} almost everywhere in 0 < t < μ μ . {\displaystyle 0<t<\mu .}

As a corollary, if the integral above is 0 for all x > 0 , {\textstyle x>0,} then either φ φ {\textstyle \varphi \,} or ψ ψ {\textstyle \psi } is almost everywhere 0 in the interval [ 0 , + ∞ ∞ ) . {\textstyle [0,+\infty ).} Thus the convolution of two functions on [ 0 , + ∞ ∞ ) {\textstyle [0,+\infty )} cannot be identically zero unless at least one of the two functions is identically zero.

As another corollary, if φ φ ∗ ∗ ψ ψ ( x ) = 0 {\displaystyle \varphi *\psi (x)=0} for all x ∈ ∈ [ 0 , κ κ ] {\displaystyle x\in [0,\kappa ]} and one of the function φ φ {\displaystyle \varphi } or ψ ψ {\displaystyle \psi } is almost everywhere not null in this interval, then the other function must be null almost everywhere in [ 0 , κ κ ] {\displaystyle [0,\kappa ]} .

The theorem can be restated in the following form:

Let φ φ , ψ ψ ∈ ∈ L 1 ( R ) {\displaystyle \varphi ,\psi \in L^{1}(\mathbb {R} )} . Then inf supp ⁡ ⁡ φ φ ∗ ∗ ψ ψ = inf supp ⁡ ⁡ φ φ + inf supp ⁡ ⁡ ψ ψ {\displaystyle \inf \operatorname {supp} \varphi \ast \psi =\inf \operatorname {supp} \varphi +\inf \operatorname {supp} \psi } if the left-hand side is finite. Similarly, sup supp ⁡ ⁡ φ φ ∗ ∗ ψ ψ = sup supp ⁡ ⁡ φ φ + sup supp ⁡ ⁡ ψ ψ {\displaystyle \sup \operatorname {supp} \varphi \ast \psi =\sup \operatorname {supp} \varphi +\sup \operatorname {supp} \psi } if the right-hand side is finite.

Above, supp {\displaystyle \operatorname {supp} } denotes the support of a function f (i.e., the closure of the complement of f−1(0)) and inf {\displaystyle \inf } and sup {\displaystyle \sup } denote the infimum and supremum. This theorem essentially states that the well-known inclusion supp ⁡ ⁡ φ φ ∗ ∗ ψ ψ ⊂ ⊂ supp ⁡ ⁡ φ φ + supp ⁡ ⁡ ψ ψ {\displaystyle \operatorname {supp} \varphi \ast \psi \subset \operatorname {supp} \varphi +\operatorname {supp} \psi } is sharp at the boundary.

The higher-dimensional generalization in terms of the convex hull of the supports was proven by Jacques-Louis Lions in 1951:cite-ref-2[2]

If φ φ , ψ ψ ∈ ∈ E ′ ( R n ) {\displaystyle \varphi ,\psi \in {\mathcal {E}}'(\mathbb {R} ^{n})} , then c . h . ⁡ ⁡ supp ⁡ ⁡ φ φ ∗ ∗ ψ ψ = c . h . ⁡ ⁡ supp ⁡ ⁡ φ φ + c . h . ⁡ ⁡ supp ⁡ ⁡ ψ ψ {\displaystyle \operatorname {c.h.} \operatorname {supp} \varphi \ast \psi =\operatorname {c.h.} \operatorname {supp} \varphi +\operatorname {c.h.} \operatorname {supp} \psi }

Above, c . h . {\displaystyle \operatorname {c.h.} } denotes the convex hull of the set and E ′ ( R n ) {\displaystyle {\mathcal {E}}'(\mathbb {R} ^{n})} denotes the space of distributions with compact support.

The original proof by Titchmarsh uses complex-variable techniques, and is based on the Phragmén–Lindelöf principle, Jensen's inequality, Carleman's theorem, and Valiron's theorem. The theorem has since been proven several more times, typically using either real-variablecite-ref-3[3]cite-ref-4[4]cite-ref-5[5] or complex-variablecite-ref-6[6]cite-ref-7[7]cite-ref-8[8] methods. Gian-Carlo Rota has stated that no proof yet addresses the theorem's underlying combinatorial structure, which he believes is necessary for complete understanding.cite-ref-9[9]

cite-note-11. ↑ citereftitchmarsh1926Titchmarsh, E. C. (1926). "The Zeros of Certain Integral Functions". Proceedings of the London Mathematical Society. s2-25 (1): 283–302. doi:10.1112/plms/s2-25.1.283.

cite-note-22. ↑ citereflions1951Lions, Jacques-Louis (1951). "Supports de produits de composition". Comptes rendus. 232 (17): 1530–1532.

cite-note-33. ↑ citerefdoss1988Doss, Raouf (1988). "An elementary proof of Titchmarsh's convolution theorem" (PDF). Proceedings of the American Mathematical Society. 104 (1).

cite-note-44. ↑ citerefkalisch1962Kalisch, G. K. (1962-10-01). "A functional analysis proof of titchmarsh's theorem on convolution". Journal of Mathematical Analysis and Applications. 5 (2): 176–183. doi:10.1016/S0022-247X(62)80002-X. ISSN 0022-247X.

cite-note-55. ↑ citerefmikusi-ski1953Mikusiński, J. (1953). "A new proof of Titchmarsh's theorem on convolution". Studia Mathematica. 13 (1): 56–58. doi:10.4064/sm-13-1-56-58. ISSN 0039-3223.

cite-note-66. ↑ citerefcrum1941Crum, M. M. (1941). "On the resultant of two functions". The Quarterly Journal of Mathematics. os-12 (1): 108–111. doi:10.1093/qmath/os-12.1.108. ISSN 0033-5606.

cite-note-77. ↑ citerefdufresnoy1947Dufresnoy, Jacques (1947). "Sur le produit de composition de deux fonctions". Comptes rendus. 225: 857–859.

cite-note-88. ↑ citerefboas1954Boas, Ralph P. (1954). Entire functions. New York: Academic Press. ISBN 0-12-108150-8. OCLC 847696. {{cite book}}: ISBN / Date incompatibility (help)

cite-note-99. ↑ citerefrota1998Rota, Gian-Carlo (1998-06-01). "Ten Mathematics Problems I will never solve". Mitteilungen der Deutschen Mathematiker-Vereinigung (in German). 6 (2): 45–52. doi:10.1515/dmvm-1998-0215. ISSN 0942-5977. S2CID 120569917.